/// @tags: Greedy
#include <cstdio>
#include <iostream>

using namespace std;

namespace BlueQuantum {

typedef long long LL;

int n1, n2, n3, m1, m2, m3;
LL s1, s2, s3;

inline int main() {
  cin >> n1 >> n2 >> n3;
  m1 = m2 = m3 = 0x3f3f3f3f;
  for (int i = 1, a; i <= n1; ++i) cin >> a, m1 = min(m1, a), s1 += a;
  for (int i = 1, a; i <= n2; ++i) cin >> a, m2 = min(m2, a), s2 += a;
  for (int i = 1, a; i <= n3; ++i) cin >> a, m3 = min(m3, a), s3 += a;
  LL ans = 0;
  ans = max(ans, s2 + s3 - s1);
  ans = max(ans, s1 + s3 - s2);
  ans = max(ans, s1 + s2 - s3);
  ans = max(ans, s1 + s2 + s3 - 2 * min(m1 + m2, min(m1 + m3, m2 + m3)));
  cout << ans;
  return 0;
}

}  // namespace BlueQuantum

int main() {
#ifndef ONLINE_JUDGE
#ifdef LOCAL
  freopen("/tmp/CodeTmp/testdata.in", "r", stdin);
  freopen("/tmp/CodeTmp/testdata.out", "w", stdout);
#else
  freopen("CF1467C Three Bags.in", "r", stdin);
  freopen("CF1467C Three Bags.out", "w", stdout);
#endif
#endif

  ios::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
  return BlueQuantum::main();
}
